全文获取类型
收费全文 | 2485篇 |
免费 | 175篇 |
国内免费 | 99篇 |
专业分类
化学 | 259篇 |
晶体学 | 2篇 |
力学 | 4篇 |
综合类 | 30篇 |
数学 | 2363篇 |
物理学 | 101篇 |
出版年
2024年 | 2篇 |
2023年 | 50篇 |
2022年 | 64篇 |
2021年 | 48篇 |
2020年 | 103篇 |
2019年 | 99篇 |
2018年 | 92篇 |
2017年 | 87篇 |
2016年 | 66篇 |
2015年 | 54篇 |
2014年 | 90篇 |
2013年 | 227篇 |
2012年 | 73篇 |
2011年 | 137篇 |
2010年 | 135篇 |
2009年 | 240篇 |
2008年 | 191篇 |
2007年 | 146篇 |
2006年 | 154篇 |
2005年 | 94篇 |
2004年 | 87篇 |
2003年 | 110篇 |
2002年 | 69篇 |
2001年 | 49篇 |
2000年 | 45篇 |
1999年 | 27篇 |
1998年 | 27篇 |
1997年 | 25篇 |
1996年 | 25篇 |
1995年 | 8篇 |
1994年 | 15篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2759条查询结果,搜索用时 15 毫秒
51.
Tutte's 5‐flow conjecture from 1954 states that every bridgeless graph has a nowhere‐zero 5‐flow. It suffices to prove the conjecture for cyclically 6‐edge‐connected cubic graphs. We prove that every cyclically 6‐edge‐connected cubic graph with oddness at most 4 has a nowhere‐zero 5‐flow. This implies that every minimum counterexample to the 5‐flow conjecture has oddness at least 6. 相似文献
52.
The class of cographs is known to have unbounded linear clique‐width. We prove that a hereditary class of cographs has bounded linear clique‐width if and only if it does not contain all quasi‐threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes. 相似文献
53.
S. Dommers C. Külske P. Schriever 《Stochastic Processes and their Applications》2017,127(11):3719-3753
We study Gibbs distributions of spins taking values in a general compact Polish space, interacting via a pair potential along the edges of a generalized random graph with a given asymptotic weight distribution , obtained by annealing over the random graph distribution.First we prove a variational formula for the corresponding annealed pressure and provide criteria for absence of phase transitions in the general case.We furthermore study classes of models with second order phase transitions which include rotation-invariant models on spheres and models on intervals, and classify their critical exponents. We find critical exponents which are modified relative to the corresponding mean-field values when becomes too heavy-tailed, in which case they move continuously with the tail-exponent of . For large classes of models they are the same as for the Ising model treated in Dommers et al. (2016). On the other hand, we provide conditions under which the model is in a different universality class, and construct an explicit example of such a model on the interval. 相似文献
54.
Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017 相似文献
55.
56.
Prof. Dr. Holger Braunschweig Theresa Dellermann Dr. William C. Ewing Thomas Kramer Christoph Schneider Stefan Ullrich 《Angewandte Chemie (International ed. in English)》2015,54(35):10271-10275
The syntheses of sulfur‐ and selenium‐bridged cyclic compounds containing boron stabilized by N‐heterocyclic carbenes (NHCs) have been achieved by the reductive insertion of elemental chalcogens into boron–boron multiple bonds. The three pairs of bonding electrons between the boron atoms in the triply bonded diboryne enabled six‐electron reduction reactions, resulting in the formation of [2.2.1]‐bicyclic systems wherein bridgehead boron atoms are spanned by three chalcogen bridges. A similar reaction using a diborene (boron–boron double bond) resulted in the reductive transfer of both pairs of bonding electrons to three sulfur atoms, yielding a NHC‐stabilized trisulfidodiborolane. The demonstration of these six‐ and four‐electron reductions lends support to the presence of three and two pairs of bonding electrons between the boron atoms of the diboryne and diborene, respectively, a fact that may be useful in future discussions on bond order. 相似文献
57.
Eckhard Steffen 《Journal of Graph Theory》2015,78(3):195-206
Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. Any list of three 1‐factors induces a core of a cubic graph. We use results on the structure of cores to prove sufficient conditions for Berge‐covers and for the existence of three 1‐factors with empty intersection. Furthermore, if , then is an upper bound for the girth of G. We also prove some new upper bounds for the length of shortest cycle covers of bridgeless cubic graphs. Cubic graphs with have a 4‐cycle cover of length and a 5‐cycle double cover. These graphs also satisfy two conjectures of Zhang 18 . We also give a negative answer to a problem stated in 18 . 相似文献
58.
We prove part of a conjecture by Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28.) regarding threshold functions for the existence of an H‐factor in a random graph . We prove that the conjectured threshold function is correct for any graph H which is not covered by its densest subgraphs. We also demonstrate that the main result of Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28) generalizes to multigraphs, digraphs, and a multipartite model. 相似文献
59.
The independence number of a sparse random graph G(n,m) of average degree d = 2m/n is well‐known to be with high probability, with in the limit of large d. Moreover, a trivial greedy algorithm w.h.p. finds an independent set of size , i.e., about half the maximum size. Yet in spite of 30 years of extensive research no efficient algorithm has emerged to produce an independent set with size for any fixed (independent of both d and n). In this paper we prove that the combinatorial structure of the independent set problem in random graphs undergoes a phase transition as the size k of the independent sets passes the point . Roughly speaking, we prove that independent sets of size form an intricately rugged landscape, in which local search algorithms seem to get stuck. We illustrate this phenomenon by providing an exponential lower bound for the Metropolis process, a Markov chain for sampling independent sets. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 436–486, 2015 相似文献